Green energy of discrete signed measure on concentric circles
نویسندگان
چکیده
We show that the difference between Green energy of a discrete signed measure relative to circular annulus concentrated at some points on concentric circles and symmetric is non-decreasing during expansion annulus. As corollary, generalizations classical Pólya-Schur inequality for complex numbers are obtained. Some open problems formulated.
منابع مشابه
Sampling on Concentric Circles
Two forms of a sampling theorem for concentric circles are established for a bandlimited two-dimensional (2-D) function. The location of the samples is prescribed either on equidistant circles or on the roots of the Bessel function J0( ). Both methods give comparable results, however, the number of samples required for their numerical evaluation is significantly less for the root-sampling formu...
متن کاملOn net-Laplacian Energy of Signed Graphs
A signed graph is a graph where the edges are assigned either positive ornegative signs. Net degree of a signed graph is the dierence between the number ofpositive and negative edges incident with a vertex. It is said to be net-regular if all itsvertices have the same net-degree. Laplacian energy of a signed graph is defined asε(L(Σ)) =|γ_1-(2m)/n|+...+|γ_n-(2m)/n| where γ_1,...,γ_n are the ei...
متن کاملDrawing Metro Maps on Concentric Circles
This thesis examines algorithms for the drawing of metro maps. The most important elements of a metro map are stations and lines connecting the stations. In the context of this thesis, we restrict the elements used for representing lines to one of two classes: On the one hand, circular segments lying on circles with a common center S are allowed. On the other hand, line segments lying on lines ...
متن کاملCamera Calibration Using Two Concentric Circles
We present a simple calibration method for computing the extrinsic parameters (pose) and intrinsic parameters (focal length and principal point) of a camera by imaging a pattern of known geometry. Usually, the patterns used in calibration algorithms are complex to build (three orthogonal planes) or need a lot of features (checkerboard-like pattern). We propose using just two concentric circles ...
متن کاملRandom Walks on Discrete and Continuous Circles
We consider a large class of random walks on the discrete circle Z/(n), defined in terms of a piecewise Lipschitz function, and motivated by the “generation gap” process of Diaconis. For such walks, we show that the time until convergence to stationarity is bounded independently of n. Our techniques involve Fourier analysis and a comparison of the random walks on Z/(n) with a random walk on the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Izvestiya: Mathematics
سال: 2023
ISSN: ['1468-4810', '1064-5632']
DOI: https://doi.org/10.4213/im9343e